Function-Private Conditional Disclosure of Secrets and Multi-evaluation Threshold Distributed Point Functions

نویسندگان

چکیده

Conditional disclosure of secrets (CDS) allows multiple parties to reveal a secret third party if and only some pre-decided condition is satisfied. In this work, we bolster the privacy guarantees CDS by introducing function-private wherein never revealed party. We also derive function sharing scheme from our solution. The second problem that consider concerns threshold distributed point functions, which allow one split such at least number shares are required evaluate it any given input. setting among set evaluations do not leak non-negligible information about it. Finally, present provably optimal procedure perform polynomial in finite field.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Additive Conditional Disclosure of Secrets And Applications

During a conditional disclosure of secrets (CDS) protocol, Alice obtains a secret, held by Bob, if and only if her inputs to the protocol were “valid”. As an output masking technique, CDS protocol can be used as a subroutine in other protocols to guarantee either Bob-privacy or correctness against a malicious Alice. Using a simple seeded randomness extractor, we extend the Aiello-Ishai-Reingold...

متن کامل

New Protocols for Conditional Disclosure of Secrets (and More)

We present new protocols for conditional disclosure of secrets (CDS), where two parties want to disclose a secret to a third party if and only if their respective inputs satisfy some predicate. • For general predicatesP : [N ]×[N ]→ {0,1}, we present two protocols that achieve o(N1/2) communication: the first achievesO(N1/3) communication and the second achieves sub-polynomial 2O( p logN loglog...

متن کامل

Conditional Disclosure of Secrets via Non-linear Reconstruction

We present new protocols for conditional disclosure of secrets (CDS), where two parties want to disclose a secret to a third party if and only if their respective inputs satisfy some predicate. • For general predicates P : [N ]×[N ] → {0,1}, we present two protocols that achieve o(N 1/2) communication: the first achieves O(N 1/3) communication and the second achieves sub-polynomial 2O( p log N ...

متن کامل

Communication Complexity of Conditional Disclosure of Secrets and Attribute-Based Encryption

We initiate a systematic treatment of the communication complexity of conditional disclosure of secrets (CDS), where two parties want to disclose a secret to a third party if and only if their respective inputs satisfy some predicate. We present a general upper bound and the first nontrivial lower bounds for conditional disclosure of secrets. Moreover, we achieve tight lower bounds for many int...

متن کامل

Conditional Disclosure of Secrets: Amplification, Closure, Amortization, Lower-Bounds, and Separations

In the conditional disclosure of secrets problem (Gertner et al., J. Comput. Syst. Sci., 2000) Alice and Bob, who hold inputs x and y respectively, wish to release a common secret s to Carol (who knows both x and y) if only if the input (x, y) satisfies some predefined predicate f . Alice and Bob are allowed to send a single message to Carol which may depend on their inputs and some joint rando...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Lecture Notes in Computer Science

سال: 2021

ISSN: ['1611-3349', '0302-9743']

DOI: https://doi.org/10.1007/978-3-030-92548-2_18